Remarks on Distance Based Topological Indices for ℓ-Apex Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance-Based Topological Indices and Double graph

Let $G$ be a connected graph, and let $D[G]$ denote the double graph of $G$. In this paper, we first derive closed-form formulas for different distance based topological indices for $D[G]$ in terms of that of $G$. Finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

Weighted Harary indices of apex trees and k-apex trees

If G is a connected graph, then HA(G) = ∑ u6=v(deg(u) + deg(v))/d(u, v) is the additively Harary index and HM (G) = ∑ u6=v deg(u) deg(v)/d(u, v) the multiplicatively Harary index of G. G is an apex tree if it contains a vertex x such that G − x is a tree and is a k-apex tree if k is the smallest integer for which there exists a k-set X ⊆ V (G) such that G − X is a tree. Upper and lower bounds o...

متن کامل

Distance-based topological indices of tensor product of graphs

Let G and H be connected graphs. The tensor product G + H is a graph with vertex set V(G+H) = V (G) X V(H) and edge set E(G + H) ={(a , b)(x , y)| ax ∈ E(G) & by ∈ E(H)}. The graph H is called the strongly triangular if for every vertex u and v there exists a vertex w adjacent to both of them. In this article the tensor product of G + H under some distancebased topological indices are investiga...

متن کامل

distance-based topological indices and double graph

let $g$ be a connected graph, and let $d[g]$ denote the double graph of $g$. in this paper, we first derive closed-form formulas for different distance based topological indices for $d[g]$ in terms of that of $g$. finally, as illustration examples, for several special kind of graphs, such as, the complete graph, the path, the cycle, etc., the explicit formulas for some distance based topologica...

متن کامل

ON DISTANCE-BASED TOPOLOGICAL INDICES OF HC5C7[4p,8] NANOTUBES

Let G be a connected graph, nu(e) is the number of vertices of G lying closer to u and nv(e) is the number of vertices of G lying closer to v. Then the Szeged index of G is defined as the sum of nu(e)nv(e), over edges of G.. The PI index of G is a Szeged-like topological index defined as the sum of [mu(e)+ mv(e)], where mu(e) is the number of edges of G lying closer to u than to v, mv(e) is the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Symmetry

سال: 2020

ISSN: 2073-8994

DOI: 10.3390/sym12050802